翻訳と辞書 Words near each other ・ Pseudopyrenula ・ Pseudorabies ・ Pseudoradiarctia ・ Pseudoradiarctia affinis ・ Pseudoradiarctia lentifasciata ・ Pseudoradiarctia rhodesiana ・ Pseudoradiarctia scita ・ Pseudoraja fischeri ・ Pseudoramonia ・ Pseudorandom binary sequence ・ Pseudorandom encoder ・ Pseudorandom ensemble ・ Pseudorandom function family ・ Pseudorandom generator ・ Pseudorandom generator theorem ・ Pseudorandom generators for polynomials ・ Pseudorandom noise ・ Pseudorandom number generator ・ Pseudorandom permutation ・ Pseudorandomness ・ Pseudorange ・ Pseudoraniceps ・ Pseudoraphis ・ Pseudorapidity ・ Pseudorasbora ・ Pseudorationalism ・ Pseudorbilia ・ Pseudorbis ・ Pseudorbis granulum ・ Pseudorbis jameoensis Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Pseudorandom generators for polynomials ： ウィキペディア英語版 Pseudorandom generators for polynomials In theoretical computer science, a pseudorandom generator for low-degree polynomials is an efficient procedure that maps a short truly random seed to a longer pseudorandom string in such a way that low-degree polynomials cannot distinguish the output distribution of the generator from the truly random distribution. That is, evaluating any low-degree polynomial at a point determined by the pseudorandom string is statistically close to evaluating the same polynomial at a point that is chosen uniformly at random. Pseudorandom generators for low-degree polynomials are a particular instance of pseudorandom generators for statistical tests, where the statistical tests considered are evaluations of low-degree polynomials. ==Definition== A pseudorandom generator $G:\; \backslash mathbb^\backslash ell\; \backslash rightarrow\; \backslash mathbb^n$ for polynomials of degree $d$ over a finite field $\backslash mathbb\; F$ is an efficient procedure that maps a sequence of $\backslash ell$ field elements to a sequence of $n$ field elements such that any $n$-variate polynomial over $\backslash mathbb\; F$ of degree $d$ is fooled by the output distribution of $G$. In other words, for every such polynomial $p(x\_1,\backslash dots,x\_n)$, the statistical distance between the distributions $p(U\_n)$ and $p(G(U\_\backslash ell))$ is at most a small $\backslash epsilon$, where $U\_k$ is the uniform distribution over $\backslash mathbb^k$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Pseudorandom generators for polynomials」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.